Employing AI Techniques in Probabilistic Model Checking Position Paper
نویسندگان
چکیده
Probabilistic model-checking (PMC) is a new frontier in model checking verification, useful for checking randomized algorithms, communications protocols with random components, etc. AI techniques have been incorporated into conventional model-checking, with great success. We wish to see if corresponding successes can be found by applying AI techniques to PMC. In this position paper, we introduce PMC. We present the probabilistic automata and probabilistic bounded LTL used in modeling for PMC. We also introduce some existing tools for PMC. With this background in place, we discuss challenges and opportunities for incorporating AI techniques in PMC, and our current work in the area.
منابع مشابه
A Simple Probabilistic Extension of Modal Mu-calculus
Probabilistic systems are an important theme in AI domain. As the specification language, PCTL is the most frequently used logic for reasoning about probabilistic properties. In this paper, we present a natural and succinct probabilistic extension of μ-calculus, another prominent logic in the concurrency theory. We study the relationship with PCTL. Surprisingly, the expressiveness is highly ort...
متن کاملStatistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on developing numerical solution methods for model checking of continuous-time Markov chains. Numerical techniques tend to scale poorly with an increase in the size of the model (the “state space explosion problem”), howe...
متن کاملProbabilistic Analysis Using Theorem Proving
In this chapter, the authors first provide the overall methodology for the theorem proving formal probabilistic analysis followed by a brief introduction to the HOL4 theorem prover. The main focus of this book is to provide a comprehensive framework for formal probabilistic analysis as an alternative to less accurate techniques like simulation and paper-and-pencil methods and to other less scal...
متن کاملTowards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given plan achieves the desired objective. Historically, in AI, the planning and plan checking problems were mainly formulated and solved in a deterministic environment, when the initial state is known precisely and when the r...
متن کاملProbabilistic model checking in practice: Case studies with PRISM1
In this paper, we describe some practical applications of probabilistic model checking, a technique for the formal analysis of systems which exhibit stochastic behaviour. We give an overview of a selection of case studies carried out using the probabilistic model checking tool PRISM, demonstrating the wide range of application domains to which these methods are applicable. We also illustrate se...
متن کامل